package demo1;

public class Test {
    //遍历一个二叉树
    public static void main(String[] args) {
        String str = "hello";
        boolean b = str.charAt(0) != 'x';
        System.out.println(b);
      //  System.out.println(str.charAt(9));
        Solution solution = new Solution();
        TreeNode root = solution.createBinaryTree();
        solution.levelOrder(root);
    }
}
